Graphical Explanation in Belief Networks
نویسندگان
چکیده
Belief networks provide an important bridge between statistical modeling and expert systems. In this paper we present methods for visualizing probabilistic “evidence flows” in belief networks, thereby enabling belief networks to explain their behavior. Building on earlier research on explanation in expert systems, we present a hierarchy of explanations, ranging from simple colorings to detailed displays. Our approach complements parallel work on textual explanations in belief networks. GRAPHICAL-BELIEF, Mathsoft Inc.’s belief network software, implements the methods.
منابع مشابه
Accelerating chromosome evaluation for partial abductive inference in Bayesian networks by means of explanation set absorption
Partial abductive inference in Bayesian belief networks (BBNs) is intended as the process of generating the K most probable con®gurations for a set of unobserved variables (the explanation set). This problem is NP-hard and so exact computation is not always possible. In previous works genetic algorithms (GAs) have been used to solve the problem in an approximate way by using exact probabilities...
متن کاملCorrectness of Belief Propagation in Gaussian Graphical Models of Arbitrary Topology Correctness of Belief Propagation in Gaussian Graphical Models of Arbitrary Topology
Graphical models, such as Bayesian networks and Markov random elds represent statistical dependencies of variables by a graph. Local \belief propagation" rules of the sort proposed by Pearl [20] are guaranteed to converge to the correct posterior probabilities in singly connected graphs. Recently good performance has been obtained by using these same rules on graphs with loops, a method known a...
متن کاملDuality of Graphical Models and Tensor Networks
In this article we show the duality between tensor networks and undirected graphical models with discrete variables. We study tensor networks on hypergraphs, which we call tensor hypernetworks. We show that the tensor hypernetwork on a hypergraph exactly corresponds to the graphical model given by the dual hypergraph. We translate various notions under duality. For example, marginalization in a...
متن کاملFinding MAPs using strongly equivalent high order recurrent symmetric connectionist networks
Belief revision is the problem of finding the most plausible explanation for an observed set of evidences. It has many applications in various scientific domains like natural language understanding, medical diagnosis and computational biology. Bayesian Networks (BN) is an important probabilistic graphical formalism widely used for belief revision tasks. In BN, belief revision can be achieved by...
متن کاملFinding MAPs Using High Order Recurrent Networks
Belief revision is the problem of finding the most plausible explanation for an observed set of evidences. This has many applications in various scientific domains like natural language understanding, medical diagnosis and computational biology. Bayesian Networks (BN) is an important probabilistic graphical formalism used widely for belief revision tasks. In BN, belief revision can be achieved ...
متن کامل